On chromatic and flow polynomial unique graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

On the Absolute Sum of Chromatic Polynomial Coefficient of Graphs

For a century ago, one of the most famous problems in mathematics was to prove the FourColor Problem. During the period that the Four-Color Problem was unsolved, which spanned more than a century, many approaches were introduced with the hopes that they would lead to a solution of this famous problem. In 1913, Birkhoff 1 defined a function P M,λ that gives the number of proper λ-colorings of a ...

متن کامل

On Chromatic Polynomial and Ordinomial

1 1 Introduction 2 1 Introduction Suppose Γ is a graph with |V (Γ)| = n. For λ a positive integer, let [λ] = {1, 2,. .. , λ} be a set of λ distinct colors. A λ-coloring of Γ is a mapping f from V (Γ) to [λ]. Whenever for every two adjacent vertices u and v, f (u) = f (v), we will call f a proper coloring of Γ; otherwise, improper. When a proper λ-coloring exists, we call Γ a λ-colorable graph. ...

متن کامل

The locating-chromatic number for Halin graphs

Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...

متن کامل

Just chromatic exellence in fuzzy graphs

A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2008

ISSN: 0166-218X

DOI: 10.1016/j.dam.2007.10.010